Local model checking for infinite state spaces
نویسندگان
چکیده
منابع مشابه
Liveness Checking as Safety Checking for Infinite State Spaces
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for model checking of liveness properties, help to find shortest counterexamples, and overcome limitations of closed-source model-checking tools. In this paper we show that a similar reduction can be applied to a number of i...
متن کاملGlobal vs. Local Model Checking of Infinite State Systems
The verification of systems with infinite state spaces has attained considerable attention in recent years. In particular, both global and local model checking techniques have been applied to the verification of such systems. However, new symbolic representations like predicate logics and finite automata have only been used in global model checking. In this paper, we therefore propose a techniq...
متن کاملSelfless Interpolation for Infinite-State Model Checking
We present a new method for interpolation in satisfiability modulo theories (SMT) that is aimed at applications in model-checking and invariant inference. The new method allows us to control the finiteconvergence of interpolant sequences and, at the same time, provides expressive invariant-driven interpolants. It is based on a novel integration of model-driven quantifier elimination and abstrac...
متن کاملGlobal Model-Checking of Infinite-State Systems
We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata. Chec...
متن کاملImage Computation in Infinite State Model Checking
The model checking of a counters system S often reduces to the effective computation of the set of predecessors Pre∗S(X) of a set of integer vectors X. Because the exact computation of this set is not possible in general, we are interested in characterizing the minimal Number Decision Diagrams (NDD) [WB00] that represents the set Pre(X). In particular, its size is proved to be just polynomially...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90183-g